Dynamic path planning for a mobile robot using image processing
نویسندگان
چکیده
منابع مشابه
Obstacle Prediction–based Dynamic Path Planning for a Mobile Robot
A path-planning method based on a combination of the static global and the dynamic local pathplanning methods is proposed for robot path planning under a complex environment. There are known static obstacles and unknown dynamic obstacles in any complex environment. The local-path planner dynamically generates a local path using obstacle-motion prediction and a rolling window for dynamic path pl...
متن کاملCNN Processing Techniques for Image-Based Path Planning of a Mobile Robot
The paper presents methods for images processing in order to path planning of a mobile robot in an environment with obstacles. The CNNs (Cellular Neural Networks) methods have been considered a good solution for image processing in autonomous mobile robots guidance. The choice of CNNs for the visual processing part is based on the possibility of their hardware implementation in large networks o...
متن کاملMobile Robot Path Planning Using Genetic Algorithms
Genetic Algorithms (GAs) have demonstrated to be effective procedures for solving multicriterion optimization problems. These algorithms mimic models of natural evolution and have the ability to adaptively search large spaces in near-optimal ways. One direct application of this intelligent technique is in the area of evolutionary robotics, where GAs are typically used for designing behavioral c...
متن کاملPath Planning for a Mobile Robot Using Genetic Algorithms
This paper presents a new algorithm for global path planning to a goal for a mobile robot using Genetic Algorithm (GA). A genetic algorithm is used to find the optimal path for a mobile robot to move in a static environment expressed by a map with nodes and links. Locations of target and obstacles to find an optimal path are given in an environment that is a 2-D workplace. Each via point (landm...
متن کاملPath Relaxation: Path Planning for a Mobile Robot
Path Relaxation is a method of planning safe paths around obstacles for mobile robots. It works in two steps: a global grid starch that finds a rough path, followed by a local relaxation step that adjusts each node on the path to lower the overall path cost. The representation used by Path Relaxation allows an explicit tradeoff among length of path, clearance away from obstacles, and distance t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2012
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/24/4/605